103 research outputs found
Dealing with Interference in Distributed Large-scale MIMO Systems: A Statistical Approach
This paper considers the problem of interference control through the use of
second-order statistics in massive MIMO multi-cell networks. We consider both
the cases of co-located massive arrays and large-scale distributed antenna
settings. We are interested in characterizing the low-rankness of users'
channel covariance matrices, as such a property can be exploited towards
improved channel estimation (so-called pilot decontamination) as well as
interference rejection via spatial filtering. In previous work, it was shown
that massive MIMO channel covariance matrices exhibit a useful finite rank
property that can be modeled via the angular spread of multipath at a MIMO
uniform linear array. This paper extends this result to more general settings
including certain non-uniform arrays, and more surprisingly, to two dimensional
distributed large scale arrays. In particular our model exhibits the dependence
of the signal subspace's richness on the scattering radius around the user
terminal, through a closed form expression. The applications of the
low-rankness covariance property to channel estimation's denoising and
low-complexity interference filtering are highlighted.Comment: 12 pages, 11 figures, to appear in IEEE Journal of Selected Topics in
Signal Processin
Asynchronous CDMA Systems with Random Spreading-Part I: Fundamental Limits
Spectral efficiency for asynchronous code division multiple access (CDMA)
with random spreading is calculated in the large system limit allowing for
arbitrary chip waveforms and frequency-flat fading. Signal to interference and
noise ratios (SINRs) for suboptimal receivers, such as the linear minimum mean
square error (MMSE) detectors, are derived. The approach is general and
optionally allows even for statistics obtained by under-sampling the received
signal.
All performance measures are given as a function of the chip waveform and the
delay distribution of the users in the large system limit. It turns out that
synchronizing users on a chip level impairs performance for all chip waveforms
with bandwidth greater than the Nyquist bandwidth, e.g., positive roll-off
factors. For example, with the pulse shaping demanded in the UMTS standard,
user synchronization reduces spectral efficiency up to 12% at 10 dB normalized
signal-to-noise ratio. The benefits of asynchronism stem from the finding that
the excess bandwidth of chip waveforms actually spans additional dimensions in
signal space, if the users are de-synchronized on the chip-level. The analysis
of linear MMSE detectors shows that the limiting interference effects can be
decoupled both in the user domain and in the frequency domain such that the
concept of the effective interference spectral density arises. This generalizes
and refines Tse and Hanly's concept of effective interference.
In Part II, the analysis is extended to any linear detector that admits a
representation as multistage detector and guidelines for the design of low
complexity multistage detectors with universal weights are provided
Asynchronous CDMA Systems with Random Spreading-Part II: Design Criteria
Totally asynchronous code-division multiple-access (CDMA) systems are
addressed. In Part I, the fundamental limits of asynchronous CDMA systems are
analyzed in terms of spectral efficiency and SINR at the output of the optimum
linear detector. The focus of Part II is the design of low-complexity
implementations of linear multiuser detectors in systems with many users that
admit a multistage representation, e.g. reduced rank multistage Wiener filters,
polynomial expansion detectors, weighted linear parallel interference
cancellers. The effects of excess bandwidth, chip-pulse shaping, and time delay
distribution on CDMA with suboptimum linear receiver structures are
investigated. Recursive expressions for universal weight design are given. The
performance in terms of SINR is derived in the large-system limit and the
performance improvement over synchronous systems is quantified. The
considerations distinguish between two ways of forming discrete-time
statistics: chip-matched filtering and oversampling
Robust Pilot Decontamination Based on Joint Angle and Power Domain Discrimination
We address the problem of noise and interference corrupted channel estimation
in massive MIMO systems. Interference, which originates from pilot reuse (or
contamination), can in principle be discriminated on the basis of the
distributions of path angles and amplitudes. In this paper we propose novel
robust channel estimation algorithms exploiting path diversity in both angle
and power domains, relying on a suitable combination of the spatial filtering
and amplitude based projection. The proposed approaches are able to cope with a
wide range of system and topology scenarios, including those where, unlike in
previous works, interference channel may overlap with desired channels in terms
of multipath angles of arrival or exceed them in terms of received power. In
particular we establish analytically the conditions under which the proposed
channel estimator is fully decontaminated. Simulation results confirm the
overall system gains when using the new methods.Comment: 14 pages, 5 figures, accepted for publication in IEEE Transactions on
Signal Processin
The Waterfilling Game-Theoretical Framework for Distributed Wireless Network Information Flow
International audienceWe present a general game-theoretical framework for the resource allocation problem in the down- link scenario of distributed wireless small-cell networks, where multiple access points (APs) or small base stations send independent coded network information to multiple mobile terminals (MTs) through orthogonal frequency division multiplexing (OFDM) channels. In such a game-theoretic study, the central question is whether a Nash equilibrium (NE) exists, and if so, whether the network operates efficiently at the NE. For independent continuous fading channels, we prove that the probability of a unique NE existing in the game is equal to 1. We show that this resource allocation problem can be studied as a potential game, and hence efficiently solved. We discuss the convergence of waterfilling based best-response algorithm. Finally, numerical results are provided to investigate the inefficiency of NE
- …